Embedding digraphs of small size
نویسندگان
چکیده
منابع مشابه
Embedding Digraphs on Orientable Surfaces
We consider a notion of embedding digraphs on orientable surfaces, applicable to digraphs in which the indegree equals the outdegree for every vertex, i.e., Eulerian digraphs. This idea has been considered before in the context of “compatible Euler tours” or “orthogonal A-trails” by Andsersen at al [1] and by Bouchet [4]. This prior work has mostly been limited to embeddings of Eulerian digraph...
متن کاملPolymorphisms of Small Digraphs
For each digraph with at most 5 vertices, we provide a list of its polymorphisms interesting with respect to the complexity of the corresponding Constraint Satisfaction Problem. We find a digraph on six vertices such that the complexity of its retraction problem is unknown with current techniques; this is the smallest such example. AMS Mathematics Subject Classification (2000): 05C85, 68R10, 08A70
متن کاملEmbedding quartic Eulerian digraphs on the plane
Minimal obstructions for embedding 4-regular Eulerian digraphs on the plane are considered in relation to the partial order defined by the cycle removal operation. Their basic properties are provided and all obstructions with parallel arcs are classified. ∗ The author is thankful for support from the Marsden Fund (Grant Number UOA-825) administered by the Royal Society of New Zealand. This gran...
متن کاملThe number of digraphs with small diameter
k) denote the l1um ber of of order nand diam-In this paper it is that: fixed k :~, ii) for every fixed k 1, n! where with D(n;d=n k:):Sn! (n) are polynomials of degree k 1 in n coefficients depending only on k. c;o:rres1)(:m(img results for undirected graphs given in [2]. of a vertex :r is the number of vertices of CJ that nr1PO'l'PP d-(x) is the number of vertices of G ~UII~~'~HU connected dig...
متن کاملVertex-symmetric Digraphs with Small Diameter
There is increasing interest in the design of dense vertex-symmetric graphs and digraphs as models of interconnection networks for implementing parallelism. In these systems many nodes are connected with relatively few links and short paths between them and each node may execute, without modifications, the same communication software. In this paper we give new families of dense vertex-symmetric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00209-9